Bound Computation of Dependability and Performance Measures

نویسندگان

  • Stephanie Mahévas
  • Gerardo Rubino
چکیده

We propose a new method to obtain bounds of dependability, performance or performability measures concerning complex systems modeled by a large Markov model. Its extends previous published techniques mainly designed to the analysis of dependability measures only, and working under more restrictive conditions. Our approach allows to obtain tight bounds of performance measures on certain cases, and in particular, on models having an infinite state space. We illustrate the method with some analytically intractable open queuing networks, as well as with large dependability models. Index Terms — Dependability evaluation, performance evaluation, Markov chains, numerical analysis, bounding techniques.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Expected Impulse Rewards in Markov Regenerative Stochastic Petri Nets ?

Reward structures provide a versatile tool for the de nition of performance and dependability measures in stochastic Petri nets. In this paper we derive formulas for the computation of expected reward measures in Markov regenerative stochastic Petri nets, which allow for transitions with non-exponentially distributed ring times. The reward measures may be composed of rate rewards which are obta...

متن کامل

Markov Renewal Theory Applied to Performability Evaluation

Computer and communication systems are designed to meet a certain speciied behavior. The procurement of metrics to establish how well the system behaves, that is, how closely it follows the speciied behavior , is the objective of quantitative analysis. Traditionally, performance and dependability evaluation are used as separate approaches to provide quantitative gures of system behavior. Perfor...

متن کامل

Availability Analysis of Repairable Computer Systems and Stationarity Detection

ÐPoint availability and expected interval availability are dependability measures respectively defined by the probability that a system is in operation at a given instant and by the mean percentage of time during which a system is in operation over a finite observation period. We consider a repairable computer system and we assume, as usual, that the system is modeled by a finite Markov process...

متن کامل

Transient Solution of Markov Models by Combining Adaptive and Standard Uniformization

Adaptive uniformization AU has recently been proposed as a method to compute transient measures in continuous time Markov chains and has been shown to be especially attractive for solving large and sti dependability models The major advantage of AU is that it requires at most as many iterations as standard uniformization SU and often far fewer thus resulting in substantial computational savings...

متن کامل

CASPA: A Tool for Symbolic Performance and Dependability Evaluation

Symbolic data structures, such as binary decision diagrams (BDD) [1] and variants thereof have proved to be suitable for the efficient generation and compact representation of very large state spaces and transition systems. The key to such compact representation is the exploitation of the compositional structure of a given specification [2], [3]. It is also known that in addition to functional ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Computers

دوره 50  شماره 

صفحات  -

تاریخ انتشار 2001